A New Type of Counting Derivation for CD Grammar Systems
نویسندگان
چکیده
منابع مشابه
External versus Internal Hybridization for Cooperating Distributed Grammar Systems
Mitrana and PP aun commenced a study on cooperating distributed (CD) grammar systems with components working in diierent derivation modes, called hybrid CD grammar systems. In this paper, we introduce several hybrid derivation modes of CD grammar systems and characterize via this internal hybridization (i.e., all grammars of a CD grammar system work in the same mode) several external hy-bridiza...
متن کاملLocal splicing grammar systems
A new type of splicing is defined, namely the interchange of two fixed subwords, without moving the sequences situated after them. Idea of splicing grammar systems is introduced by Dassow and Mitrana, ([2]); in this paper only the derivation type is changed. The generative power is the same (are necessarily only two modules to generate all recursive enumerable languages). Two variants of deriva...
متن کاملOn Distributed Cooperation and Synchronised Collaboration
In CD grammar systems, the rewriting process is distributed over component grammars that take turns in the derivation of new symbols. Team automata however collaborate by synchronising their actions. Here we investigate how to transfer this concept of synchronisation to grammars by defining grammar teams that agree on the generation of shared terminal symbols based on a novel notion of competen...
متن کاملFormal Systems Based upon Automata and Grammars
This work is based on my PhD thesis, which continues with studying of grammar and automata systems. First of all, it deals with regularly controlled CD grammar systems with phrase-structure grammars as components. Into these systems, three new derivation restrictions are placed and their effect on the generative power of these systems are investigated. Thereafter, the thesis defines two automat...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999